On the Number of Solutions Generated by Dantzig’s Simplex Method for LP with Bounded Variables∗
نویسندگان
چکیده
We give an upper bound for the number of different basic feasible solutions generated by Dantzig’s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard form of LP. Then we utilize the improved bound for an LP with bounded variables. We show some results when the bound is applied to the minimum cost flow problem and the maximum flow problem.
منابع مشابه
A Strongly Polynomial Simplex Method for Totally Unimodular LP
Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method for linear programming (LP). In this paper, we combine results of Kitahara and Mizuno and Tardos’s strongly polynomial algorithm, and propose an algorithm for solving a standard form LP problem. The algorithm solves polynomial number of artificial LP problems by the simplex method with Dantzi...
متن کاملLower Bounds for the Maximum Number of Solutions Generated by the Simplex Method
Kitahara and Mizuno [3] get upper bounds for the maximum number of different basic feasible solutions generated by Dantzig’s simplex method. In this paper, we obtain lower bounds of the maximum number. Part of the results in this paper are shown in Kitahara and Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty’s LP and get a lower bound. In this paper, we e...
متن کاملKlee-Minty's LP and upper bounds for Dantzig's simplex method
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic feasible solutions generated by Dantzig’s simplex method. The size of the bounds highly depends on the ratio between the maximum and minimum values of all the positive elements of basic feasible solutions. In this paper, we show some relations between the ratio and the number of iterations by using an example of L...
متن کاملAn Upper Bound for the Number of Different solutions Generated by the Primal Simplex Method with any Selection Rule of entering Variables
Kitahara and Mizuno (2011a) obtained an upper bound for the number of different solutions generated by the primal simplex method with Dantzig’s (the most negative) pivoting rule. In this paper, we obtain an upper bound with any pivoting rule which chooses an entering variable whose reduced cost is negative at each iteration. The bound is applied to special linear programming problems. We also g...
متن کاملNew Optimal Pivot Rule for the Simplex Algorithm
The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). One of the important steps of the simplex algorithm is applying an appropriate pivot rule to select the basis-entering variable corresponding to the maximum reduced cost. Unfortunat...
متن کامل